منابع مشابه
Greedy Packet Scheduling
Scheduling packets to be forwarded over a link is an important subtask of the routing process both in paxalhl computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithms that always forward a packet if they can. It is first proved that for various "natural" classes of routes, the time required to complete the transmission...
متن کاملGreedy Packet Scheduling on Shortest Paths
We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that only one packet can be delivered over a link in a single step, and that the routes traversed by a set of packets are distance optimal (“shortest paths”), we prove that the time required to complete transmission of a packet in the set is bounded by its rout...
متن کاملGreedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
متن کاملBroadcast scheduling in packet radio networks using mixed tabu-greedy algorithm - Electronics Letters
Introduction: The broadcast scheduling problem (BSP) is to find a collision-free scheduling of transmissions of all the stations in a minimum number of time slots. The final arrangement of the station transmissions into their allocated time slots is called a frame. Consider a packet radio network (PRN) represented by a graph G1⁄4 (V, E), where V is the set of nodes and E the set of edges. An N ...
متن کاملGreedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
Fair scheduling algorithms are an important component of most QoS mechanisms designed to support the performance guarantees required by real-time applications. In this paper, we present Greedy Fair Queueing (GrFQ), a novel scheduler based on a greedy strategy of reducing the maximum difference in normalized service received by any two flows at each trasmission boundary. We prove that the GrFQ s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1995
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539791217695